Determining Maximum k-Width-Connectivity on Meshes
نویسندگان
چکیده
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
منابع مشابه
Determining Maximum itk-Width Connectivity on Meshes
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملSVOČ 2009 Computability of Branch-width of Submodular Partition Functions
The notion of submodular partition functions generalizes many of well-known tree decompositions of graphs. For fixed k, there are polynomial-time algorithms to determine whether a graph has tree-width, branch-width, etc. at most k. Contrary to these results, we show that there is no sub-exponential algorithm for determining whether the width of a given submodular partition function is at most t...
متن کاملSearching Constant Width Mazes Captures the AC0 Hierarchy
We show that searching a width k maze is complete for k , i.e., for the k'th level of the AC 0 hierarchy. Equivalently, st-connectivity for width k grid graphs is complete for k. As an application, we show that there is a data structure solving dynamic st-connectivity for constant width grid graphs with time bound O(log log n) per operation on a random access machine. The dynamic algorithm is d...
متن کاملFast exact algorithms for some connectivity problems parametrized by clique-width
Given a clique-width expression of a graph G of clique-width k, we provide 2O(k) ·nO(1) time algorithms for connectivity constraints on locally checkable properties such as Connected Dominating Set, Connected Perfect Dominating Set or Node-Weighted Steiner Tree. We also propose an 2O(k) ·nO(1) time algorithm for Feedback Vertex Set. The best running times for all the considered cases were eithe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996